On reducing linearizability to state reachability
نویسندگان
چکیده
منابع مشابه
On Reducing Linearizability to State Reachability
Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria — linearizability with respect to given ADT specifications — are hard to verify. Even on classes of implementations where the usual temporal safety properties like control-state reachab...
متن کاملOn Reducing Linearizability to State Reachability1
E cient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic veri cation. Unfortunately their correctness criteria linearizability with respect to given ADT speci cations are hard to verify. Even on classes of implementations where the usual temporal safety properties like control-state reachability ar...
متن کاملReducing Context-Bounded Concurrent Reachability to Sequential Reachability
We give a translation from concurrent programs to sequential programs that reduces the context-bounded reachability problem in the concurrent program to a reachability problem in the sequential one. The translation has two salient features: (a) the sequential program tracks, at any time, the local state of only one thread (though it does track multiple copies of shared variables), and (b) all r...
متن کاملReducing Opacity to Linearizability: A Sound and Complete Method
Transactional memory is a mechanism that manages thread synchronisation on behalf of a programmer so that blocks of code execute with an illusion of atomicity. The main safety criterion for transactional memory is opacity, which defines conditions for serialising concurrent transactions. Proving opacity is complicated because it allows concurrent transactions to observe distinct memory states, ...
متن کاملR-linearizability: an Extension of Linearizability to Replicated Objects
The paper extends linearizability, a consistency criterion for concurrent systems, to the replicated context , where availability and performance are enhanced by using redundant objects. The mode of operation on sets of replicas and the consistency criterion of R-linearizability are deened. An implementation of R-linearizable replicated atoms (on which only read and write operations are deened)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2018
ISSN: 0890-5401
DOI: 10.1016/j.ic.2018.02.014